All graphs in which each pair of distinct vertices has exactly two common neighbors
نویسندگان
چکیده
منابع مشابه
On Sets Which Meet Each Line in Exactly Two Points
ABSTRACT Using techniques from geometric measure theory and descriptive set theory we prove a general result concerning sets in the plane which meet each straight line in exactly two points As an application we show that no such two point set can be expressed as the union of countably many recti able sets together with a set with Hausdor measure zero Also as another corollary we show that no an...
متن کاملSubgraphs in Which Each Pair of Edges Lies in a Short Common Cycle
By a k-graph we mean a pair G = (V,E) consisting of a finite set V of vertices and a collection E of distinct k-element subsets of V called the edges of G . Our object here is to show that each such k-graph with sufficiently many vertices and sufficiently many edges must contain a subgraph H (that is, a "sub-k-graph" H), also having many edges, and having the property that each pair of edges of...
متن کاملComputing the k Nearest-Neighbors for all Vertices via Dijkstra
We are given a directed graph G = (V,E) with n vertices and m edges, with positive weights on the edges, and a parameter k > 0. We show how to compute, for every vertex v ∈ V , its k nearest-neighbors. The algorithm runs in O(k(n log n + m)) time, and follows by a somewhat careful modification of Dijkstra’s shortest path algorithm. This result is probably folklore, but we were unable to find a ...
متن کاملSmall graphs with exactly two non-negative eigenvalues
Let $G$ be a graph with eigenvalues $lambda_1(G)geqcdotsgeqlambda_n(G)$. In this paper we find all simple graphs $G$ such that $G$ has at most twelve vertices and $G$ has exactly two non-negative eigenvalues. In other words we find all graphs $G$ on $n$ vertices such that $nleq12$ and $lambda_1(G)geq0$, $lambda_2(G)geq0$ and $lambda_3(G)0$, $lambda_2(G)>0$ and $lambda_3(G)
متن کاملOccupation games on graphs in which the second player takes almost all vertices
Given a connected graph G = (V,E), two players take turns occupying vertices v ∈ V by putting black and white tokens so that the current vertex sets B,W ⊆ V are disjoint, B ∩W = ∅, and the corresponding induced subgraphs G[B] and G[W ] are connected any time. A player must pass whenever (s)he has no legal move. (Obviously, after this, the opponent will take all remaining vertices, since G is as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Bohemica
سال: 2005
ISSN: 0862-7959,2464-7136
DOI: 10.21136/mb.2005.134219